首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   86549篇
  免费   7291篇
  国内免费   5452篇
化学   23791篇
晶体学   1813篇
力学   4222篇
综合类   458篇
数学   23953篇
物理学   45055篇
  2022年   228篇
  2021年   429篇
  2020年   799篇
  2019年   1109篇
  2018年   1050篇
  2017年   801篇
  2016年   708篇
  2015年   586篇
  2014年   1336篇
  2013年   2262篇
  2012年   1528篇
  2011年   2097篇
  2010年   2618篇
  2009年   7256篇
  2008年   8364篇
  2007年   6772篇
  2006年   6275篇
  2005年   4320篇
  2004年   4065篇
  2003年   4282篇
  2002年   5004篇
  2001年   3944篇
  2000年   3723篇
  1999年   3561篇
  1998年   2915篇
  1997年   2044篇
  1996年   1867篇
  1995年   2317篇
  1994年   2222篇
  1993年   1676篇
  1992年   1170篇
  1991年   898篇
  1990年   743篇
  1989年   646篇
  1988年   631篇
  1987年   451篇
  1986年   232篇
  1985年   998篇
  1984年   672篇
  1983年   518篇
  1982年   692篇
  1981年   820篇
  1980年   767篇
  1979年   598篇
  1978年   601篇
  1977年   571篇
  1976年   565篇
  1975年   324篇
  1974年   364篇
  1973年   464篇
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
61.
62.
63.
64.
Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models.  相似文献   
65.
闫熙  马昌凤 《计算数学》2019,41(1):37-51
本文针对求矩阵方程AXB+CXD=F唯一解的参数迭代法,分析当矩阵A,B,C,D均是Hermite正(负)定矩阵时,迭代矩阵的特征值表达式,给出了最优参数的确定方法,并提出了相应的加速算法.  相似文献   
66.
This paper develops a framework to deal with the unconditional superclose analysis of nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example, a new mixed finite element method (FEM) is established and the $τ$ -independent superclose results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an error splitting technique, with which the time-discrete and the spatial-discrete systems are constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require certain time step conditions. Finally, some numerical results are provided to confirm the theoretical analysis, and show the efficiency of the proposed method.  相似文献   
67.
68.
The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.  相似文献   
69.
It is shown that for , there exists an optimal packing with triples on points that contains no Pasch configurations. Furthermore, for all (mod 6), there exists a pairwise balanced design of order , whose blocks are all triples apart from a single quintuple, and that has no Pasch configurations amongst its triples.  相似文献   
70.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号